منابع مشابه
The Transitive Closure of a Random Digraph
In a random n-vertex digraph, each arc is present with probability p, independently of the presence or absence of other arcs. We investigate the structure of the strong components of a random digraph and present an algorithm for the construction of the transitive closure of a random digraph. We show that, when n is large and np is equal to a constant c greater than 1, it is very likely that all...
متن کاملOn the Distribution of the Transitive Closure in a Random Acyclic Digraph
In the usual Gn;p{model of a random acyclic digraph let n (1) be the size of the reeexive, transitive closure of node 1, a source node; then the distribution of n (1) is given by where q = 1 ? p. Our analysis points out some surprising relations between this distribution and known functions of the number theory. In particular we nd for the expectation of n (1): lim n!1 n ? E(n (1)) = L(q) where...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملq{Distributions in Random Graphs: Transitive Closure and Reduction
One of the classical topics in discrete mathematics and in computer science is the computation of the transitive closure and reduction of a directed graph. We provide a complete analysis of the random variables counting the size of the transitive closure and reduction in random acyclic digraphs. In particular we present closed forms for their probability distribution and moments, showing that t...
متن کاملAn Infinite Highly Arc-transitive Digraph
The main purpose of this note is to construct an infinite , highly arc-transitive digraph with finite out-valency , and with out-spread greater than 1 , which does not have the two-way infinite path Z as a homomorphic image . This answers Question 3 . 8 in the paper [3] of Cameron , Praeger and Wormald . Our digraph has infinite in-valency . By a result of Praeger (see [5]) , a connected , vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 1990
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.3240010106